The concept of “state” in discrete dynamic programming

AbstractDynamic programming problems have always been stated in terms of stages, states, decisions, rewards, and transformations. This paper investigates the possibility of starting the analysis with a much simpler, i.e., coarser, structure than is commonly required. It establishes necessary and sufficient conditions for the analysis of such generally stated problems by the methodology of dynamic programming